package com.example.leetcode.graph;

import com.example.leetcode.graph.common.GraphUtils;

import java.util.List;

class Solution1489 {
    public List<List<Integer>> findCriticalAndPseudoCriticalEdges(int n, int[][] edges) {
        return GraphUtils.findCriticalAndPseudoCriticalEdges(n, edges);
    }
}

public class leetcode1489 {
    public static void main(String[] args) {
        Solution1489 solution1489 = new Solution1489();
        int n = 5;
        int[][] edges = {{0, 1, 1}, {1, 2, 1}, {2, 3, 2}, {0, 3, 2}, {0, 4, 3}, {3, 4, 3}, {1, 4, 6}};
        System.out.println(solution1489.findCriticalAndPseudoCriticalEdges(n, edges));
    }
}
